#include <bits/stdc++.h>
using namespace std;

int isprime(int n) {
	if (n <= 1) {
		return 0;
	}
	for (int i = 2; i < sqrt(n); i++) {
		if (n % i == 0) {
			return 0;
		}
	}
	return 1;
}

int main() {
	char str[105] = {0};
	int i = 0;
	int flag = 0;
	int hash[26] = {0};
	cin >> str;
	while (str[i] != '\0') {
		hash[str[i] - 97]++;
		++i;
	}
	sort(hash, hash + 26);
	for (flag = 0; flag < 25; flag++) {
		if (hash[flag] != 0)
			break;
	}
	int ans = isprime(hash[25] - hash[flag]);
	if (ans == 1) {
		cout << "Lucky Word" << endl;
		cout << hash[25] - hash[flag];
	} else {
		cout << "No Answer" << endl;
		cout << 0;
	}
	return 0;
}